190 research outputs found

    Fast Dynamic Graph Algorithms for Parameterized Problems

    Full text link
    Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to as the update time and the query time respectively. There are many researches on dynamic graphs whose update time and query time are o(G)o(|G|), that is, sublinear in the graph size. However, almost all such researches are for problems in P. In this paper, we investigate dynamic graphs for NP-hard problems exploiting the notion of fixed parameter tractability (FPT). We give dynamic graphs for Vertex Cover and Cluster Vertex Deletion parameterized by the solution size kk. These dynamic graphs achieve almost the best possible update time O(poly(k)logn)O(\mathrm{poly}(k)\log n) and the query time O(f(poly(k),k))O(f(\mathrm{poly}(k),k)), where f(n,k)f(n,k) is the time complexity of any static graph algorithm for the problems. We obtain these results by dynamically maintaining an approximate solution which can be used to construct a small problem kernel. Exploiting the dynamic graph for Cluster Vertex Deletion, as a corollary, we obtain a quasilinear-time (polynomial) kernelization algorithm for Cluster Vertex Deletion. Until now, only quadratic time kernelization algorithms are known for this problem. We also give a dynamic graph for Chromatic Number parameterized by the solution size of Cluster Vertex Deletion, and a dynamic graph for bounded-degree Feedback Vertex Set parameterized by the solution size. Assuming the parameter is a constant, each dynamic graph can be updated in O(logn)O(\log n) time and can compute a solution in O(1)O(1) time. These results are obtained by another approach.Comment: SWAT 2014 to appea

    Possibilities of alternative generation II biotests at Artemia

    Get PDF
    The meaning of alternative biotests is described and discussed. The paper also deals with the possible application of the developmental studies of the sea Artemia franciscana nauplinus. Five-day biotests including the validation criteria are described. The possibilities of the biotests are very wide. Additionally to the standard applications in ecotoxicology, there is a possibility of modelling pharmacological experiments or monitoring the effects of ionizing radiation and the interaction with other chemicals

    Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count

    Full text link
    We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D=Ω(n)D=\Omega(\sqrt n), and at most min(2nΩ(n),2nD2)\min\bigl(2n-\Omega(\sqrt n),2n-D-2\bigr) edges.Comment: 10 pages, 2 figures. To appear at the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

    Self-avoiding walks and connective constants

    Full text link
    The connective constant μ(G)\mu(G) of a quasi-transitive graph GG is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on GG from a given starting vertex. We survey several aspects of the relationship between the connective constant and the underlying graph GG. \bullet We present upper and lower bounds for μ\mu in terms of the vertex-degree and girth of a transitive graph. \bullet We discuss the question of whether μϕ\mu\ge\phi for transitive cubic graphs (where ϕ\phi denotes the golden mean), and we introduce the Fisher transformation for SAWs (that is, the replacement of vertices by triangles). \bullet We present strict inequalities for the connective constants μ(G)\mu(G) of transitive graphs GG, as GG varies. \bullet As a consequence of the last, the connective constant of a Cayley graph of a finitely generated group decreases strictly when a new relator is added, and increases strictly when a non-trivial group element is declared to be a further generator. \bullet We describe so-called graph height functions within an account of "bridges" for quasi-transitive graphs, and indicate that the bridge constant equals the connective constant when the graph has a unimodular graph height function. \bullet A partial answer is given to the question of the locality of connective constants, based around the existence of unimodular graph height functions. \bullet Examples are presented of Cayley graphs of finitely presented groups that possess graph height functions (that are, in addition, harmonic and unimodular), and that do not. \bullet The review closes with a brief account of the "speed" of SAW.Comment: Accepted version. arXiv admin note: substantial text overlap with arXiv:1304.721

    Lattice models and Landau theory for type II incommensurate crystals

    Full text link
    Ground state properties and phonon dispersion curves of a classical linear chain model describing a crystal with an incommensurate phase are studied. This model is the DIFFOUR (discrete frustrated phi4) model with an extra fourth-order term added to it. The incommensurability in these models may arise if there is frustration between nearest-neighbor and next-nearest-neighbor interactions. We discuss the effect of the additional term on the phonon branches and phase diagram of the DIFFOUR model. We find some features not present in the DIFFOUR model such as the renormalization of the nearest-neighbor coupling. Furthermore the ratio between the slopes of the soft phonon mode in the ferroelectric and paraelectric phase can take on values different from -2. Temperature dependences of the parameters in the model are different above and below the paraelectric transition, in contrast with the assumptions made in Landau theory. In the continuum limit this model reduces to the Landau free energy expansion for type II incommensurate crystals and it can be seen as the lowest-order generalization of the simplest Lifshitz-point model. Part of the numerical calculations have been done by an adaption of the Effective Potential Method, orginally used for models with nearest-neighbor interaction, to models with also next-nearest-neighbor interactions.Comment: 33 pages, 7 figures, RevTex, submitted to Phys. Rev.

    Quantitative trait loci conferring grain mineral nutrient concentrations in durum wheat 3 wild emmer wheat RIL population

    Get PDF
    Mineral nutrient malnutrition, and particularly deficiency in zinc and iron, afflicts over 3 billion people worldwide. Wild emmer wheat, Triticum turgidum ssp. dicoccoides, genepool harbors a rich allelic repertoire for mineral nutrients in the grain. The genetic and physiological basis of grain protein, micronutrients (zinc, iron, copper and manganese) and macronutrients (calcium, magnesium, potassium, phosphorus and sulfur) concentration was studied in tetraploid wheat population of 152 recombinant inbred lines (RILs), derived from a cross between durum wheat (cv. Langdon) and wild emmer (accession G18-16). Wide genetic variation was found among the RILs for all grain minerals, with considerable transgressive effect. A total of 82 QTLs were mapped for 10 minerals with LOD score range of 3.2–16.7. Most QTLs were in favor of the wild allele (50 QTLs). Fourteen pairs of QTLs for the same trait were mapped to seemingly homoeologous positions, reflecting synteny between the A and B genomes. Significant positive correlation was found between grain protein concentration (GPC), Zn, Fe and Cu, which was supported by significant overlap between the respective QTLs, suggesting common physiological and/or genetic factors controlling the concentrations of these mineral nutrients. Few genomic regions (chromosomes 2A, 5A, 6B and 7A) were found to harbor clusters of QTLs for GPC and other nutrients. These identified QTLs may facilitate the use of wild alleles for improving grain nutritional quality of elite wheat cultivars, especially in terms of protein, Zn and Fe

    Lineage specific composition of cyclin D–CDK4/CDK6–p27 complexes reveals distinct functions of CDK4, CDK6 and individual D-type cyclins in differentiating cells of embryonic origin

    Get PDF
    Objectives: This article is to study the role of G1/S regulators in differentiation of pluripotent embryonic cells. Materials and methods: We established a P19 embryonal carcinoma cell-based experimental system, which profits from two similar differentiation protocols producing endodermal or neuroectodermal lineages. The levels, mutual interactions, activities, and localization of G1/S regulators were analysed with respect to growth and differentiation parameters of the cells. Results and Conclusions: We demonstrate that proliferation parameters of differentiating cells correlate with the activity and structure of cyclin A/E–CDK2 but not of cyclin D–CDK4/6–p27 complexes. In an exponentially growing P19 cell population, the cyclin D1–CDK4 complex is detected, which is replaced by cyclin D2/3–CDK4/6–p27 complex following density arrest. During endodermal differentiation kinase-inactive cyclin D2/D3–CDK4–p27 complexes are formed. Neural differentiation specifically induces cyclin D1 at the expense of cyclin D3 and results in predominant formation of cyclin D1/D2–CDK4–p27 complexes. Differentiation is accompanied by cytoplasmic accumulation of cyclin Ds and CDK4/6, which in neural cells are associated with neural outgrowths. Most phenomena found here can be reproduced in mouse embryonic stem cells. In summary, our data demonstrate (i) that individual cyclin D isoforms are utilized in cells lineage specifically, (ii) that fundamental difference in the function of CDK4 and CDK6 exists, and (iii) that cyclin D–CDK4/6 complexes function in the cytoplasm of differentiated cells. Our study unravels another level of complexity in G1/S transition-regulating machinery in early embryonic cells
    corecore